#include <iostream>
#include <cmath>

using namespace std;
const int N = 110;
double a[N][N];
const double eps = 1e-8;
int n;

int guess()
{
    int r, c;
    for (r = 0, c = 0; c < n; c++)
    {
        int t = r;
        for (int i = r; i < n; i++)
        {
            if(fabs(a[i][c]) >  fabs(a[t][c]) )
            {
                t = i;
            }
        }
        if (fabs(a[t][c]) < eps)
        {
            continue;
        }

        for (int i = c; i <= n; ++i)
        {
            swap(a[t][i], a[r][i]);
        }

        for (int i = n; i >= c; i--)
        {
            a[r][i] /= a[r][c];
        }

        for (int i = r + 1; i < n;++i)
        {
            if (fabs(a[i][c]) > eps)
            {
                for (int j = n; j >= c; j--)
                {
                    a[i][j] -= a[r][j] * a[i][c];
                }
            }
        }
        r++;
    }
    if (r < n)
    {
        for (int i = r; i < n; i++)
        {
            if (fabs(a[i][n]) > eps)
            {
                return 1;
            }
        }
        return 2;
    }
    return 0;
}
int main()
{
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n + 1; ++j)
        {
            scanf("%d", &a[i][j]);
        }
    }

    int t = guess();
    if (t == 0)
    {
        for (int i = 0; i < n; ++i)
        {
            printf("%.2f", a[i][n]);
        }
    }
    else if (t == 1)
    {
        puts("No solution");
    }
    else
    {
        puts("Infinite group solutions");
    }
    return 0;
}